In mathematical logic, a sequent is a very general kind of conditional assertion.

${\displaystyle A_{1},\,\dots ,A_{m}\,\vdash \,B_{1},\,\dots ,B_{n}.}$

A sequent may have any number m of condition formulas A_i (called "antecedents") and any number n of asserted formulas B_j (called "succedents" or "consequents"). A sequent is understood to mean that if all of the antecedent conditions are true, then at least one of the consequent formulas is true. This style of conditional assertion is almost always associated with the conceptual framework of sequent calculus.